Verifying Semantic Relations in SPIN

نویسنده

  • Hakan Erdogmus
چکیده

Spine is an experimental veri cation system based on Promela/Spin version 1.5.7. Spin is a general veri cation tool for proving correctness properties of concurrent/distributed systems speci ed in the CSP-like modeling language Promela [8, 9]. This extended abstract describing the Spine system and its foundations assumes familiarity with Promela/Spin. The Spine system extends Spin with `limited' semantic relation checking capability implemented in terms of a new option, -e, whose usage is given below:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verifying Semantic Graphs With the Model Checker SPIN

The most frequently used language to represent the semantic graphs is the RDF (W3C standard for meta-modeling). The construction of semantic graphs is a source of numerous errors of interpretation. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border between two areas: ...

متن کامل

The Semantic and Rhetorical Function of the Synonymous and Antonymous Concepts of “Infaq” in the Holy Quran

The syntagmatic (descriptive) semantic approach is an attempt to represent the words and their relations existing in the human mind. Considering this idea, the present paper, while applying this approach, seeks to provide a descriptive analysis of the concept of infaq and to explain the semantic and rhetorical function of the concepts that having a syntagmatic relation with it are sometimes use...

متن کامل

Formalizing and Verifying Semantic Type Soundness of a Simple Compiler (Preliminary Report)

We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized assembly language. Types in the high-level language are interpreted as binary relations, built using both second-order quantification and a form of separation structure, over stores and code pointers in the low-level mac...

متن کامل

A Logical Relations for a Logical Framework

Logical relations are a central concept used to study various higher-order type theories and occur frequently in the proofs of a wide variety of meta-theorems. Besides extending the logical relation principle to more general languages, an important research question has been how to represent and thus verify logical relation arguments in logical frameworks. We formulate a theory of logical relat...

متن کامل

Verifying Heisenberg’s error-disturbance relation using a single trapped ion

Heisenberg's uncertainty relations have played an essential role in quantum physics since its very beginning. The uncertainty relations in the modern quantum formalism have become a fundamental limitation on the joint measurements of general quantum mechanical observables, going much beyond the original discussion of the trade-off between knowing a particle's position and momentum. Recently, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995